#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, s, t;
int a[N];
ll sum[N];
bool check(int x) {
  rep(i, 1, n) sum[i] = sum[i - 1] + a[i] - x;
  deque<int> dq;
  int j = 0;
  rep(i, 1, n) {
    int l = i - t, r = i - s;
    if (j == r) {
      while (dq.size() && sum[dq.back()] >= sum[j]) dq.pop_back();
      dq.push_back(j++);
    }
    while (dq.size() && dq.front() < l) dq.pop_front();
    if (dq.size() && sum[dq.front()] <= sum[i]) return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> s >> t;
  rep(i, 1, n) cin >> a[i];
  rep(i, 1, n) a[i] *= 10000;
  int l = a[1], r = a[1];
  rep(i, 1, n) {
    l = min(l, a[i]);
    r = max(r, a[i]);
  }
  while (l <= r) {
    int mid = (l + r) >> 1;
    bool res = check(mid);
    if (res)
      l = mid + 1;
    else
      r = mid - 1;
  }
  double ans = r / 10000.0;
  cout << fixed << setprecision(3) << ans;
  return 0;
}